0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.34 % Computer : n009.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1200 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Jul 13 11:43:12 EDT 2021 0.12/0.35 % CPUTime : 0.12/0.35 % Number of cores: 8 0.12/0.35 % Python version: Python 3.6.8 0.12/0.35 # Version: 2.6rc1-ho 0.12/0.35 # No SInE strategy applied 0.12/0.35 # Trying AutoSched0 for 59 seconds 0.20/0.38 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. 0.20/0.38 # 0.20/0.38 # Preprocessing time : 0.029 s 0.20/0.38 # Presaturation interreduction done 0.20/0.38 0.20/0.38 # Proof found! 0.20/0.38 # SZS status Theorem 0.20/0.38 # SZS output start CNFRefutation 0.20/0.38 thf(ex1, axiom, (ex1)=(^[X1:$i, X3:$i > $o]:?[X22:$i]:(in @ X22 @ (dsetconstr @ X1 @ (^[X2:$i]:X3 @ X2))&(dsetconstr @ X1 @ (^[X2:$i]:X3 @ X2))=(setadjoin @ X22 @ emptyset))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ex1)). 0.20/0.38 thf(singleton, axiom, (singleton)=(^[X1:$i]:?[X2:$i]:(in @ X2 @ X1&(X1)=(setadjoin @ X2 @ emptyset))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', singleton)). 0.20/0.38 thf(func, axiom, (func)=(^[X1:$i, X4:$i, X6:$i]:(subset @ X6 @ (cartprod @ X1 @ X4)&![X2:$i]:(in @ X2 @ X1=>?[X23:$i]:(in @ X23 @ (dsetconstr @ X4 @ (^[X24:$i]:in @ (kpair @ X2 @ X24) @ X6))&(dsetconstr @ X4 @ (^[X26:$i]:in @ (kpair @ X2 @ X26) @ X6))=(setadjoin @ X23 @ emptyset))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', func)). 0.20/0.38 thf(breln, axiom, (breln)=(^[X1:$i, X4:$i, X5:$i]:subset @ X5 @ (cartprod @ X1 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln)). 0.20/0.38 thf(infuncsetfunc, axiom, (infuncsetfunc<=>![X1:$i, X4:$i, X8:$i]:(in @ X8 @ (funcSet @ X1 @ X4)=>func @ X1 @ X4 @ X8)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', infuncsetfunc)). 0.20/0.38 thf(funcGraphProp2, axiom, (funcGraphProp2<=>![X1:$i, X4:$i, X8:$i]:(func @ X1 @ X4 @ X8=>![X2:$i]:(in @ X2 @ X1=>![X7:$i]:(in @ X7 @ X4=>(in @ (kpair @ X2 @ X7) @ X8=>(ap @ X1 @ X4 @ X8 @ X2)=(X7)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', funcGraphProp2)). 0.20/0.38 thf(funcGraphProp4, conjecture, (infuncsetfunc=>(![X1:$i, X4:$i, X8:$i]:(in @ X8 @ (funcSet @ X1 @ X4)=>![X2:$i]:(![X7:$i]:(in @ X7 @ X4=>((ap @ X1 @ X4 @ X8 @ X2)=(X7)<=in @ (kpair @ X2 @ X7) @ X8))<=in @ X2 @ X1))<=funcGraphProp2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', funcGraphProp4)). 0.20/0.38 thf(c_0_7, axiom, (ex1)=(^[X1:$i, X3:$i > $o]:?[X22:$i]:(in @ X22 @ (dsetconstr @ X1 @ (^[X2:$i]:X3 @ X2))&(dsetconstr @ X1 @ (^[X2:$i]:X3 @ X2))=(setadjoin @ X22 @ emptyset))), inference(apply_def,[status(thm)],[ex1, singleton])). 0.20/0.38 thf(c_0_8, axiom, (func)=(^[X1:$i, X4:$i, X6:$i]:(subset @ X6 @ (cartprod @ X1 @ X4)&![X2:$i]:(in @ X2 @ X1=>?[X23:$i]:(in @ X23 @ (dsetconstr @ X4 @ (^[X24:$i]:in @ (kpair @ X2 @ X24) @ X6))&(dsetconstr @ X4 @ (^[X26:$i]:in @ (kpair @ X2 @ X26) @ X6))=(setadjoin @ X23 @ emptyset))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[func, c_0_7]), breln])). 0.20/0.38 thf(c_0_9, axiom, (infuncsetfunc)=(![X1:$i, X4:$i, X8:$i]:(in @ X8 @ (funcSet @ X1 @ X4)=>(subset @ X8 @ (cartprod @ X1 @ X4)&![X28:$i]:(in @ X28 @ X1=>?[X29:$i]:(in @ X29 @ (dsetconstr @ X4 @ (^[X30:$i]:in @ (kpair @ X28 @ X30) @ X8))&(dsetconstr @ X4 @ (^[X31:$i]:in @ (kpair @ X28 @ X31) @ X8))=(setadjoin @ X29 @ emptyset)))))), inference(apply_def,[status(thm)],[infuncsetfunc, c_0_8])). 0.20/0.38 thf(c_0_10, axiom, (funcGraphProp2)=(![X1:$i, X4:$i, X8:$i]:((subset @ X8 @ (cartprod @ X1 @ X4)&![X32:$i]:(in @ X32 @ X1=>?[X33:$i]:(in @ X33 @ (dsetconstr @ X4 @ (^[X34:$i]:in @ (kpair @ X32 @ X34) @ X8))&(dsetconstr @ X4 @ (^[X35:$i]:in @ (kpair @ X32 @ X35) @ X8))=(setadjoin @ X33 @ emptyset))))=>![X2:$i]:(in @ X2 @ X1=>![X7:$i]:(in @ X7 @ X4=>(in @ (kpair @ X2 @ X7) @ X8=>(ap @ X1 @ X4 @ X8 @ X2)=(X7)))))), inference(apply_def,[status(thm)],[funcGraphProp2, c_0_8])). 0.20/0.38 thf(c_0_11, plain, ![X30:$i, X8:$i, X28:$i]:(epred1_3 @ X28 @ X8 @ X30<=>in @ (kpair @ X28 @ X30) @ X8), introduced(definition)). 0.20/0.38 thf(c_0_12, negated_conjecture, ~((![X1:$i, X4:$i, X8:$i]:(in @ X8 @ (funcSet @ X1 @ X4)=>(subset @ X8 @ (cartprod @ X1 @ X4)&![X28:$i]:(in @ X28 @ X1=>?[X29:$i]:(in @ X29 @ (dsetconstr @ X4 @ (epred1_3 @ X28 @ X8))&(dsetconstr @ X4 @ (epred1_3 @ X28 @ X8))=(setadjoin @ X29 @ emptyset)))))=>(![X1:$i, X4:$i, X8:$i]:((subset @ X8 @ (cartprod @ X1 @ X4)&![X32:$i]:(in @ X32 @ X1=>?[X33:$i]:(in @ X33 @ (dsetconstr @ X4 @ (epred1_3 @ X32 @ X8))&(dsetconstr @ X4 @ (epred1_3 @ X32 @ X8))=(setadjoin @ X33 @ emptyset))))=>![X2:$i]:(in @ X2 @ X1=>![X7:$i]:(in @ X7 @ X4=>(in @ (kpair @ X2 @ X7) @ X8=>(ap @ X1 @ X4 @ X8 @ X2)=(X7)))))=>![X1:$i, X4:$i, X8:$i]:(in @ X8 @ (funcSet @ X1 @ X4)=>![X2:$i]:(in @ X2 @ X1=>![X7:$i]:(in @ X7 @ X4=>(in @ (kpair @ X2 @ X7) @ X8=>(ap @ X1 @ X4 @ X8 @ X2)=(X7)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[funcGraphProp4]), c_0_9]), c_0_10]), c_0_11]), c_0_11]), c_0_11]), c_0_11])])). 0.20/0.38 thf(c_0_13, negated_conjecture, ![X36:$i, X37:$i, X38:$i, X39:$i, X41:$i, X42:$i, X43:$i, X45:$i, X46:$i, X47:$i]:(((subset @ X38 @ (cartprod @ X36 @ X37)|~in @ X38 @ (funcSet @ X36 @ X37))&((in @ (esk1_4 @ X36 @ X37 @ X38 @ X39) @ (dsetconstr @ X37 @ (epred1_3 @ X39 @ X38))|~in @ X39 @ X36|~in @ X38 @ (funcSet @ X36 @ X37))&((dsetconstr @ X37 @ (epred1_3 @ X39 @ X38))=(setadjoin @ (esk1_4 @ X36 @ X37 @ X38 @ X39) @ emptyset)|~in @ X39 @ X36|~in @ X38 @ (funcSet @ X36 @ X37))))&(((in @ (esk2_3 @ X41 @ X42 @ X43) @ X41|~subset @ X43 @ (cartprod @ X41 @ X42)|(~in @ X46 @ X41|(~in @ X47 @ X42|(~in @ (kpair @ X46 @ X47) @ X43|(ap @ X41 @ X42 @ X43 @ X46)=(X47)))))&(~in @ X45 @ (dsetconstr @ X42 @ (epred1_3 @ (esk2_3 @ X41 @ X42 @ X43) @ X43))|(dsetconstr @ X42 @ (epred1_3 @ (esk2_3 @ X41 @ X42 @ X43) @ X43))!=(setadjoin @ X45 @ emptyset)|~subset @ X43 @ (cartprod @ X41 @ X42)|(~in @ X46 @ X41|(~in @ X47 @ X42|(~in @ (kpair @ X46 @ X47) @ X43|(ap @ X41 @ X42 @ X43 @ X46)=(X47))))))&(in @ esk5_0 @ (funcSet @ esk3_0 @ esk4_0)&(in @ esk6_0 @ esk3_0&(in @ esk7_0 @ esk4_0&(in @ (kpair @ esk6_0 @ esk7_0) @ esk5_0&(ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0)!=(esk7_0))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])). 0.20/0.38 thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i, X6:$i, X5:$i, X4:$i]:(in @ (esk2_3 @ X1 @ X2 @ X4) @ X1|(ap @ X1 @ X2 @ X4 @ X5)=(X6)|~subset @ X4 @ (cartprod @ X1 @ X2)|~in @ X5 @ X1|~in @ X6 @ X2|~in @ (kpair @ X5 @ X6) @ X4), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i, X4:$i]:(subset @ X1 @ (cartprod @ X2 @ X4)|~in @ X1 @ (funcSet @ X2 @ X4)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_16, negated_conjecture, ![X2:$i, X6:$i, X5:$i, X4:$i, X1:$i]:((ap @ X1 @ X2 @ X4 @ X5)=(X6)|in @ (esk2_3 @ X1 @ X2 @ X4) @ X1|~in @ (kpair @ X5 @ X6) @ X4|~in @ X4 @ (funcSet @ X1 @ X2)|~in @ X6 @ X2|~in @ X5 @ X1), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.20/0.38 thf(c_0_17, negated_conjecture, in @ (kpair @ esk6_0 @ esk7_0) @ esk5_0, inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X7:$i, X6:$i, X5:$i]:((ap @ X4 @ X2 @ X5 @ X6)=(X7)|~in @ X1 @ (dsetconstr @ X2 @ (epred1_3 @ (esk2_3 @ X4 @ X2 @ X5) @ X5))|(dsetconstr @ X2 @ (epred1_3 @ (esk2_3 @ X4 @ X2 @ X5) @ X5))!=(setadjoin @ X1 @ emptyset)|~subset @ X5 @ (cartprod @ X4 @ X2)|~in @ X6 @ X4|~in @ X7 @ X2|~in @ (kpair @ X6 @ X7) @ X5), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_19, negated_conjecture, ![X1:$i, X5:$i, X4:$i, X2:$i]:(in @ (esk1_4 @ X1 @ X2 @ X4 @ X5) @ (dsetconstr @ X2 @ (epred1_3 @ X5 @ X4))|~in @ X5 @ X1|~in @ X4 @ (funcSet @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_20, negated_conjecture, ![X2:$i, X5:$i, X4:$i, X1:$i]:((dsetconstr @ X1 @ (epred1_3 @ X2 @ X4))=(setadjoin @ (esk1_4 @ X5 @ X1 @ X4 @ X2) @ emptyset)|~in @ X2 @ X5|~in @ X4 @ (funcSet @ X5 @ X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_21, negated_conjecture, ![X2:$i, X1:$i]:((ap @ X1 @ X2 @ esk5_0 @ esk6_0)=(esk7_0)|in @ (esk2_3 @ X1 @ X2 @ esk5_0) @ X1|~in @ esk5_0 @ (funcSet @ X1 @ X2)|~in @ esk7_0 @ X2|~in @ esk6_0 @ X1), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.38 thf(c_0_22, negated_conjecture, in @ esk5_0 @ (funcSet @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_23, negated_conjecture, in @ esk7_0 @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_24, negated_conjecture, in @ esk6_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_25, negated_conjecture, (ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0)!=(esk7_0), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.38 thf(c_0_26, negated_conjecture, ![X4:$i, X7:$i, X6:$i, X5:$i, X2:$i, X1:$i]:((ap @ X1 @ X2 @ X4 @ X5)=(X6)|~in @ (esk2_3 @ X1 @ X2 @ X4) @ X7|~subset @ X4 @ (cartprod @ X1 @ X2)|~in @ (kpair @ X5 @ X6) @ X4|~in @ X4 @ (funcSet @ X7 @ X2)|~in @ X6 @ X2|~in @ X5 @ X1), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.20/0.38 thf(c_0_27, negated_conjecture, in @ (esk2_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0, inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])]), c_0_25])). 0.20/0.38 thf(c_0_28, negated_conjecture, ![X2:$i, X1:$i]:((ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1)=(X2)|~subset @ esk5_0 @ (cartprod @ esk3_0 @ esk4_0)|~in @ (kpair @ X1 @ X2) @ esk5_0|~in @ X2 @ esk4_0|~in @ X1 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_22])])). 0.20/0.38 thf(c_0_29, negated_conjecture, ![X2:$i, X1:$i]:((ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1)=(X2)|~in @ (kpair @ X1 @ X2) @ esk5_0|~in @ X2 @ esk4_0|~in @ X1 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_15]), c_0_22])])). 0.20/0.38 thf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_17]), c_0_23]), c_0_24])]), c_0_25]), ['proof']). 0.20/0.38 # SZS output end CNFRefutation 0.20/0.38 # Proof object total steps : 31 0.20/0.38 # Proof object clause steps : 17 0.20/0.38 # Proof object formula steps : 14 0.20/0.38 # Proof object conjectures : 20 0.20/0.38 # Proof object clause conjectures : 17 0.20/0.38 # Proof object formula conjectures : 3 0.20/0.38 # Proof object initial clauses used : 10 0.20/0.38 # Proof object initial formulas used : 7 0.20/0.38 # Proof object generating inferences : 7 0.20/0.38 # Proof object simplifying inferences : 13 0.20/0.38 # Training examples: 0 positive, 0 negative 0.20/0.38 # Parsed axioms : 22 0.20/0.38 # Removed by relevancy pruning/SinE : 0 0.20/0.38 # Initial clauses : 27 0.20/0.38 # Removed in clause preprocessing : 15 0.20/0.38 # Initial clauses in saturation : 12 0.20/0.38 # Processed clauses : 33 0.20/0.38 # ...of these trivial : 0 0.20/0.38 # ...subsumed : 0 0.20/0.38 # ...remaining for further processing : 33 0.20/0.38 # Other redundant clauses eliminated : 0 0.20/0.38 # Clauses deleted for lack of memory : 0 0.20/0.38 # Backward-subsumed : 1 0.20/0.38 # Backward-rewritten : 0 0.20/0.38 # Generated clauses : 14 0.20/0.38 # ...of the previous two non-trivial : 11 0.20/0.38 # Contextual simplify-reflections : 1 0.20/0.38 # Paramodulations : 14 0.20/0.38 # Factorizations : 0 0.20/0.38 # NegExts : 0 0.20/0.38 # Equation resolutions : 0 0.20/0.38 # Propositional unsat checks : 0 0.20/0.38 # Propositional check models : 0 0.20/0.38 # Propositional check unsatisfiable : 0 0.20/0.38 # Propositional clauses : 0 0.20/0.38 # Propositional clauses after purity: 0 0.20/0.38 # Propositional unsat core size : 0 0.20/0.38 # Propositional preprocessing time : 0.000 0.20/0.38 # Propositional encoding time : 0.000 0.20/0.38 # Propositional solver time : 0.000 0.20/0.38 # Success case prop preproc time : 0.000 0.20/0.38 # Success case prop encoding time : 0.000 0.20/0.38 # Success case prop solver time : 0.000 0.20/0.38 # Current number of processed clauses : 20 0.20/0.38 # Positive orientable unit clauses : 6 0.20/0.38 # Positive unorientable unit clauses: 0 0.20/0.38 # Negative unit clauses : 1 0.20/0.38 # Non-unit-clauses : 13 0.20/0.38 # Current number of unprocessed clauses: 1 0.20/0.38 # ...number of literals in the above : 7 0.20/0.38 # Current number of archived formulas : 0 0.20/0.38 # Current number of archived clauses : 13 0.20/0.38 # Clause-clause subsumption calls (NU) : 23 0.20/0.38 # Rec. Clause-clause subsumption calls : 3 0.20/0.38 # Non-unit clause-clause subsumptions : 2 0.20/0.38 # Unit Clause-clause subsumption calls : 0 0.20/0.38 # Rewrite failures with RHS unbound : 0 0.20/0.38 # BW rewrite match attempts : 0 0.20/0.38 # BW rewrite match successes : 0 0.20/0.38 # Condensation attempts : 0 0.20/0.38 # Condensation successes : 0 0.20/0.38 # Termbank termtop insertions : 2475 0.20/0.38 0.20/0.38 # ------------------------------------------------- 0.20/0.38 # User time : 0.032 s 0.20/0.38 # System time : 0.003 s 0.20/0.38 # Total time : 0.035 s 0.20/0.38 # Maximum resident set size: 1652 pages 0.20/0.39 EOF